Gromov Hyperbolicity in Strong Product Graphs

نویسندگان

  • Walter Carballosa
  • Rocío M. Casablanca
  • Amauris de la Cruz
  • José M. Rodríguez
چکیده

If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X. If X is hyperbolic, we denote by δ(X) the sharp hyperbolicity constant of X, i.e. δ(X) = inf{δ > 0 : X is δ-hyperbolic } . In this paper we characterize the strong product of two graphs G1 G2 which are hyperbolic, in terms of G1 and G2: the strong product graph G1 G2 is hyperbolic if and only if one of the factors is hyperbolic and the other one is bounded. We also prove some sharp relations between δ(G1 G2), δ(G1), δ(G2) and the diameters of G1 and G2 (and we find families of graphs for which the inequalities are attained). Furthermore, we obtain the exact values of the hyperbolicity constant for many strong product graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gromov Hyperbolicity in Mycielskian Graphs

Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph GM is hyperbolic and that δ(GM) is comparable to diam(GM). Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs;...

متن کامل

Computing the Gromov hyperbolicity of a discrete metric space

We give exact and approximation algorithms for computing the Gromov hyperbolicity of an n-point discrete metric space. We observe that computing the Gromov hyperbolicity from a fixed base-point reduces to a (max,min) matrix product. Hence, using the (max,min) matrix product algorithm by Duan and Pettie, the fixed base-point hyperbolicity can be determined in O(n) time. It follows that the Gromo...

متن کامل

Fast approximation and exact computation of negative curvature parameters of graphs

In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov hyperbolicity for geodesic metric spaces can be reduced to the study of graph hyperbolicity. Our main contribution in this note is a new characterization of hyperbolicity for graphs (and for complete geodesic metric ...

متن کامل

Small values of the hyperbolicity constant in graphs

If X is a geodesic metric space and x1, x2, x3 ∈ X , a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X . The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X . We denote by δ(X) the sharpest hyperbolicity constant of X , i.e...

متن کامل

On the Hyperbolicity of Random Graphs

Let G = (V,E) be a connected graph with the usual (graph) distance metric d : V ×V → N∪{0}. Introduced by Gromov, G is δ-hyperbolic if for every four vertices u, v, x, y ∈ V , the two largest values of the three sums d(u, v) + d(x, y), d(u, x) + d(v, y), d(u, y) + d(v, x) differ by at most 2δ. In this paper, we determine precisely the value of this hyperbolicity for most binomial random graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2013